package week_06;


public class MinDistance_72 {

    public int minDistance(String word1, String word2) {
        int n = word1.length();
        int m = word2.length();
        int[][] dp = new int[n + 1][m + 1];
        for (int i = 0; i <= n; i++) {
            dp[i][0] = i;
        }

        for (int j = 0; j <= m; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                dp[i][j] = Math.min(dp[i][j - 1] + 1, dp[i - 1][j] + 1);
                int eq = word1.charAt(i - 1) == word2.charAt(j - 1) ? 0 : 1;
                dp[i][j] = Math.min(dp[i][j], dp[i - 1][j - 1] + eq);
            }
        }
        return dp[n][m];
    }

    public static void main(String[] args) {
        String word1 = "abcd";
        String word2 = "ad";
        MinDistance_72 test = new MinDistance_72();
        test.minDistance(word1, word2);
    }
}
